#include <stdio.h>
#include <time.h>
int prime(int n){
  if (n == 2)
    return 1;
  if (n < 2 || n % 2 == 0)
    return 0;
  int c;
  for (c = 3; c *c <= n; c += 2)
    if (n % c == 0)
      return 0;
  return 1;
}

//-------------------------------------------------------------------------

int main(){
  // freopen("gold.out","w",stdout);
  int start = 6, end = 2000000;
  int n, find, p;
  for (n = start; n <= end; n += 2){
    for (find = 0, p = 3; p <= n / 2; p += 2)
      if (find = prime(p) && prime(n - p))
        break;
    if (!find)
      puts("Congratulations!,The goldbach theory is wrong!");
  }
  return 0;
}
